The Computational Complexity of Integer Programming with Alternations
نویسندگان
چکیده
منابع مشابه
The Computational Complexity of Integer Programming with Alternations
We prove that integer programming with three alternating quantifiers is NPcomplete, even for a fixed number of variables. This complements earlier results by Lenstra and Kannan, which together say that integer programming with at most two alternating quantifiers can be done in polynomial time for a fixed number of variables. As a byproduct of the proof, we show that for two polytopes P,Q ⊂ R, c...
متن کاملComputational complexity and an integer programming model of Shakashaka
Shakashaka is a pencil-and-paper puzzle proposed by Guten and popularized by the Japanese publisher Nikoli (like Sudoku). We determine the computational complexity by proving that Shakashaka is NP-complete, and furthermore that counting the number of solutions if #P-complete. Next we formulate Shakashaka as an integer programming (IP) problem, and show that an IP solver can solve every instance...
متن کاملOn the Complexity of Quantified Integer Programming
Quantified integer programming is the problem of deciding assertions of the form Qkxk . . . ∀x2 ∃x1 : A·x ≥ c where vectors of variables xk, . . . ,x1 form the vector x, all variables are interpreted over N (alternatively, over Z), and A and c are a matrix and vector over Z of appropriate sizes. We show in this paper that quantified integer programming with alternation depth k is complete for t...
متن کاملThe Graver Complexity of Integer Programming
Yael Berstein Shmuel Onn Abstract In this article we establish an exponential lower bound on the Graver complexity of integer programs. This provides new type of evidence supporting the presumable intractability of integer programming. Specifically, we show that the Graver complexity of the incidence matrix of the complete bipartite graph K3,m satisfies g(m) = Ω(2 ), with g(m) ≥ 17 ·2−7 for eve...
متن کاملComplexity of Primal Methods in Integer Programming
One common approach to solve optimization problems is the primal method. One starts with a feasible point and then successively produces new feasible solutions with better objective function values until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration, i.e., given a feasible point find an augmenting vector, if one exists. The d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2020
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.2018.0988